A Proof of Strong Normalization For the Theory of Constructions Using a Kripke-Like Interpretation1
نویسندگان
چکیده
We give a proof that all terms that type-check in the theory of constructions are strongly normalizing (under-reduction). The main novelty of this proof is that it uses a \Kripke-like" interpretation of the types and kinds, and that it does not use innnite contexts. We explore some consequences of strong normalization, consistency and decidability of type-checking. We also show that our proof yields another proof of strong normalization for LF (under-reduction), using the reducibility method.
منابع مشابه
A Proof of Strong Normalization for the Theory of Constructions Using a Kripke-Like Interpretation
We give a proof that all terms that type-check in the theory of contructions are strongly normalizing (under ßreduction). The main novelty of this proof is that it uses a "Kripke-like" interpretation of the types and kinds, and that it does not use infinite contexts. We explore some consequences of strong normalization, consistency and decidability of typechecking. We also show that our proof y...
متن کاملA Semantic Proof that Reducibility Candidates entail Cut Elimination
Two main lines have been adopted to prove the cut elimination theorem: the syntactic one, that studies the process of reducing cuts, and the semantic one, that consists in interpreting a sequent in some algebra and extracting from this interpretation a cut-free proof of this very sequent. A link between those two methods was exhibited by studying in a semantic way, syntactical tools that allow ...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملA Formalization of the Strong Normalization Proof for System F in LEGO
We describe a complete formalization of a strong normalization proof for the Curry style presentation of System F in LEGO. The underlying type theory is the Calculus of Constructions enriched by inductive types. The proof follows Girard et al GLT89], i.e. we use the notion of candidates of reducibility, but we make essential use of general inductive types to simplify the presentation. We discus...
متن کاملOn Strong Normalization of the Calculus of Constructions with Type-Based Termination
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-based termination is a mechanism for ensuring termination that uses types annotated with size information to check that recursive calls are performed on smaller arguments. Our long-term goal is to extend the Calculus of ...
متن کامل